Counting Occurrences of 132 in a Permutation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Counting occurrences of 132 in an even permutation

We study the generating function for the number of even (or odd) permutations on n letters containing exactly r ≥ 0 occurrences of 132. It is shown that finding this function for a given r amounts to a routine check of all permutations in S2r. 2000 Mathematics Subject Classification: Primary 05A05, 05A15; Secondary 05C90

متن کامل

9 M ay 2 00 1 COUNTING OCCURENCES OF 132 IN A PERMUTATION

We study the generating function for the number of permutations on n letters containing exactly r > 0 occurences of 132. It is shown that finding this function for a given r amounts to a routine check of all permutations in S2r . 2000 Mathematics Subject Classification: Primary 05A05, 05A15; Secondary 05C90

متن کامل

Counting occurrences of 231 in an involution

We study the generating function for the number of involutions on n letters containing exactly r 0 occurrences of 231. It is shown that finding this function for a given r amounts to a routine check of all involutions of length at most 2r + 2. © 2006 Elsevier B.V. All rights reserved.

متن کامل

Counting Occurrences of 3412 in an Involution

We study the generating function for the number of involutions on n letters containing exactly r ≥ 0 occurrences of 3412. It is shown that finding this function for a given r amounts to a routine check of all involutions on 2r + 1 letters. 2000 Mathematics Subject Classification: Primary 05A05, 05A15; Secondary 05C90

متن کامل

Counting Subwords Occurrences in Base-b Expansions

We count the number of distinct (scattered) subwords occurring in the base-b expansion of the nonnegative integers. More precisely, we consider the sequence (Sb(n))n≥0 counting the number of positive entries on each row of a generalization of the Pascal triangle to binomial coefficients of base-b expansions. By using a convenient tree structure, we provide recurrence relations for (Sb(n))n≥0 le...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Applied Mathematics

سال: 2002

ISSN: 0196-8858

DOI: 10.1006/aama.2001.0773